From Classical Extensional Higher-Order Tableau to Intuitionistic Intentional Natural Deduction
نویسندگان
چکیده
We define a translation that maps higher-order formulas provable in a classical extensional setting to semantically equivalent formulas provable in an intuitionistic intensional setting. For the classical extensional higher-order proof system we define a Henkincomplete tableau calculus. For the intuitionistic intensional higher-order proof system we give a natural deduction calculus. We prove that tableau provability of a formula implies provability of a translated formula in the natural deduction calculus. Implicit in this proof is a method for translating classical extensional tableau refutations into intuitionistic intensional natural deduction proofs.
منابع مشابه
A Tableau-Based Theorem Proving Method for Intuitionistic Logic
A new tableau-based calculus for first-order intuitionistic logic is proposed. The calculus is obtained from the tableau calculus for classical logic by extending its rules by A-terms. Aterms are seen as compact representation of natural deduction proofs. The benefits from that approach are two-fold. First, proof search methods known for classical logic can be adopted: Run-time-Skolemization an...
متن کاملTowards the use of Simplification Rules in Intuitionistic Tableaux
By replacement it is meant the substitution of one or more occurrences of a formula with an equivalent one. In automated deduction this can be useful to reduce the search space. In tableau calculi for classical and modal logics this technique is known as simplification and consists in replacing a formula with a logical constant (> or ⊥). Recently, this idea has been applied to Intuitionistic Lo...
متن کاملA/z-CALCULUS: AN ALGORITHMIC INTERPRETATION OF CLASSICAL NATURAL DEDUCTION
1 INTRODUCTION This paper presents a way of extending the paradigm "proofs as programs" to classical proofs. The system we use is derived from the general Free Deduction system presented in [31. Usually when considering proofs as programs, one has only in mind some kind of intuitionistic proofs. There is an obvious reason for that restriction: only intuitionistic proofs are contructive, in the ...
متن کاملApplications of Proof Theory to Isabelle
Isabelle [3, 4] is a generic theorem prover. It suppports interactive proof in several formal systems, including first-order logic (intuitionistic and classical), higher-order logic, Martin-Löf type theory, and Zermelo-Fraenkel set theory. New logics can be introduced by specifying their syntax and rules of inference. Both natural deduction and sequent calculi are allowed. Isabelle’s approach i...
متن کاملA Parigot-style Linear Λ-calculus for Full Intuitionistic Linear Logic
This paper describes a natural deduction formulation for Full Intuitionistic Linear Logic (FILL), an intriguing variation of multiplicative linear logic, due to Hyland and de Paiva. The system FILL resembles intuitionistic logic, in that all its connectives are independent, but resembles classical logic in that its sequent-calculus formulation has intrinsic multiple conclusions. From the intrin...
متن کامل